Checking Polynomial Time Complexity with Types
نویسنده
چکیده
Light Affine Logic (LAL) is a logical system due to Girard and Asperti offering a polynomial time cut-elimination procedure. It can be used as a type system for lambda-calculus, ensuring a well-typed program has a polynomial time bound on any input. Types use modalities meant to control duplication. We consider parameterized types where parameters are on the number of modalities and the type instantiation problem: given a term and a parameterized type, does there exist a valuation of the parameters such that the term admits the corresponding type? We show that this type instantiation problem is decidable for normal terms.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملThe Complexity of Model Checking Mobile Ambients
We settle the complexity bounds of the model-checking problemfor the replication-free ambient calculus with public names againstthe ambient logic without parallel adjunct. We show that the prob-lem is PSPACE-complete. For the complexity upper-bound, we de-vise a new representation of processes that remains of polynomialsize during process execution; this allows us to keep th...
متن کاملEfficient Type Checking for Path Polymorphism
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism, the ability to define functions that can operate uniformly over recursively specified applicative data structures. A typical pattern such functions resort to is x y which decomposes a compound,...
متن کاملBytecode Model Checking: An Experimental Analysis
Java bytecode verification is traditionally performed by a polynomial time dataflow algorithm. We investigate an alternative based on reducing bytecode verification to model checking. Despite an exponential worst case time complexity, model checking type-correct bytecode is polynomial in practice when carried out using an explicit state, onthe-fly model checker like Spin. We investigate this th...
متن کاملStrong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
We show that the problem of checking whether two processes definable in the syntax of Basic Parallel Processes (BPP) are strongly bisimilar is PSPACE-hard. We also demonstrate that there is a polynomial time reduction from the strong bisimilarity checking problem of regular BPP to the strong regularity (finiteness) checking of BPP. This implies that strong regularity of BPP is also PSPACE-hard.
متن کامل